Root cases of large sets of t-designs
نویسندگان
چکیده
A large set of t-(v, k, λ) designs of size N , denoted by LS[N ](t, k, v), is a partition of all k-subsets of a v-set into N disjoint t-(v, k, λ) designs, where N = ( v−t k−t ) /λ. A set of trivial necessary conditions for the existence of an LS[N ](t, k, v) is N ∣
منابع مشابه
A Few More Large Sets of t-Designs
We construct several new large sets of t-designs that are invariant under Frobenius groups, and discuss their consequences. These large sets give rise to further new large sets by means of known recursive constructions including an infinite family of large sets of 3− (v, 4, λ) designs. c © 1998 John Wiley & Sons, Inc. J Combin Designs 6: 293–308, 1998
متن کاملOn the existence of large sets of t-designs of prime sizes1
In this paper, we employ the known recursive construction methods to obtain some new existence results for large sets of t-designs of prime sizes. We also present a new recursive construction which leads to more comprehensive theorems on large sets of sizes two and three. As an application, we show that for infinitely many values of block size, the trivial necessary conditions for the existence...
متن کاملLarge sets of t-designs from t-homogeneous groups
A direct method for constructing large sets of t-designs is based on the concept of assembling orbits of a permutation group G on ksubsets of a v-set into block sets of t-designs so that these designs form a large set. If G is t-homogeneous, then any orbit is a t-design and therefore we obtain a large set by partitioning the set of orbits into parts consisting of the same number of k-subsets. I...
متن کاملSome new large sets of t-designs
By constructing a new large set of 4-(13,5,3) designs, and using a recursive construction described recently by Qiu-rong Wu, we produce an infinite family of large sets and as a byproduct an infinite family of new 4-designs. Similarly, we construct a new large set of 3-(13,4,2) designs, and obtain an infinite family of large sets of 3-designs. We also include a large set of 2-(14,4,6) designs, ...
متن کاملA non-existence result and large sets for Sarvate-Beam designs
It is shown that for 2 ≤ t ≤ n− 3, a strict t-SB(n, n− 1) design does not exist, but for n ≥ 3, a non-strict 2-SB(n, n−1) design exists. The concept of large sets for Steiner triple systems is extended to SB designs and examples of a large sets for SB designs are given.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 263 شماره
صفحات -
تاریخ انتشار 2003